Adding a General Union of a Prescribed Number of Curves with High Sum of their Degrees Improve the Hilbert Function of any Scheme
نویسنده
چکیده
Let Z ⊂ P, r ≥ 4, be a closed subscheme with dim(Z) ≤ r−4. Fix integers c > 0 and gi ≥ 0, i = 1, . . . , c. We prove that the general union of Z and c smooth curves Yi ⊂ P with genus gi and deg(Yi) ≥ r + gr as maximal rank (i.e. the expected postulation) if deg(Y1) + · · ·+ deg(Yc) 0.
منابع مشابه
Design and Synthesis of High Speed Low Power Signed Digit Adders
Signed digit (SD) number systems provide the possibility of constant-time addition, where inter-digit carry propagation is eliminated. Such carry-free addition is primarily a three-step process; adding the equally weighted SDs to form the primary sum digits, decomposing the latter to interim sum digits and transfer digits, which commonly belong to {–1, 0, 1}, and finally adding the tra...
متن کاملTopics on the Ratliff-Rush Closure of an Ideal
Introduction Let be a Noetherian ring with unity and be a regular ideal of , that is, contains a nonzerodivisor. Let . Then . The :union: of this family, , is an interesting ideal first studied by Ratliff and Rush in [15]. The Ratliff-Rush closure of is defined by . A regular ideal for which is called Ratliff-Rush ideal. The present paper, reviews some of the known prop...
متن کاملEvaluation of New MOND Interpolating Function with Rotation Curves of Galaxies
The rotation curves of a sample of 46 low- and high-surface brightness galaxies are considered in the context of Milgrom's modi_ed dynamics (MOND) to test a new interpolating function proposed by Zhao et al. (2010) [1] and compare with the results of simple interpolating function. The predicted rotation curves are calculated from the total baryonic matter based on the B-band surface photometry,...
متن کاملOn leap Zagreb indices of graphs
The first and second Zagreb indices of a graph are equal, respectively, to the sum of squares of the vertex degrees, and the sum of the products of the degrees of pairs of adjacent vertices. We now consider analogous graph invariants, based on the second degrees of vertices (number of their second neighbors), called leap Zagreb indices. A number of their basic properties is established.
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کامل